Divisibility patterns of natural numbers on a complex network
نویسندگان
چکیده
Investigation of divisibility properties of natural numbers is one of the most important themes in the theory of numbers. Various tools have been developed over the centuries to discover and study the various patterns in the sequence of natural numbers in the context of divisibility. In the present paper, we study the divisibility of natural numbers using the framework of a growing complex network. In particular, using tools from the field of statistical inference, we show that the network is scale-free but has a non-stationary degree distribution. Along with this, we report a new kind of similarity pattern for the local clustering, which we call "stretching similarity", in this network. We also show that the various characteristics like average degree, global clustering coefficient and assortativity coefficient of the network vary smoothly with the size of the network. Using analytical arguments we estimate the asymptotic behavior of global clustering and average degree which is validated using numerical analysis.
منابع مشابه
Crack Detection of Timoshenko Beams Using Vibration Behavior and Neural Network
Abstract: In this research, at first, the natural frequencies of a cracked beam are obtained analytically, then, location and depth of a crack in beam is identified by neural network method. The research is applied on a beam with an open crack for three different boundary conditions. For this purpose, at first, the natural frequencies of the cracked beam are obtained analytically, to get the ex...
متن کاملTrigonometric Expressions for Fibonacci and Lucas Numbers
The amount of literature bears witness to the ubiquity of the Fibonacci numbers and the Lucas numbers. Not only these numbers are popular in expository literature because of their beautiful properties, but also the fact that they ‘occur in nature’ adds to their fascination. Our purpose is to use a certain polynomial identity to express these numbers in terms of trigonometric functions. It is in...
متن کاملEstimating the divisibility of complex biological networks by sparseness indices
In order to understand the complex relationships among the components of biological systems, network models have been used for a long time. Although they have been extensively used for visualization, data storage, structural analysis and simulation, some computational processes are still very inefficient when applied on complex networks. In particular, any parallel simulation technique requires...
متن کاملThe Diophantine Problem for Addition and Divisibility
An algorithm is given for deciding existential formulas involving addition and the divisibility relation over the natural numbers. In this paper it will be shown that there is an algorithm for deciding formulas of the form k 0) 3x,.3x„6N A /,(*.,..., xn)\g¡(xx, ...,xtt) /-I in N (the natural numbers), where the / and g¡ are linear polynomials with integer coefficients. (a\b means "a divides b"....
متن کاملPascal’s Triangle and Divisibility
In this chapter we will be investigating the intricacies of a seemingly innocuous mathematical object Pascal’s Triangle. After a brief refresher of our understanding of the triangle, we will delve into Cellular Automata as a method of building patterns, and then relate this to a specific pattern within Pascal’s Triangle. Then we shall investigate specific divisibility identities that can aid in...
متن کامل